Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes

نویسنده

  • A. Campillo
چکیده

We present an algorithm to compute bases for the spaces L(G) and Ω(G), provided G is a rational divisor over a non-singular absolutely irreducible algebraic curve, and also another algorithm to compute the Weierstrass semigroup at P together with functions for each value in this semigroup, provided P is a rational branch of a singular plane model for the curve. The method is founded on the Brill-Noether algorithm by combining in a suitable way the theory of Hamburger-Noether expansions and the imposition of virtual passing conditions. Such algorithms are given in terms of symbolic computation by introducing the notion of symbolic Hamburger-Noether expressions. Everything can be applied to the effective construction of Algebraic Geometry codes and also in the decoding problem of such codes, including the case of the Feng and Rao scheme for one-point codes. MSC2000: 14 Q 05 – 11 T 71

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes

In this paper, we consider some practical applications of the symbolic Hamburger-Noether expressions for plane curves, which are introduced as a symbolic version of the so-called Hamburger-Noether expansions. More precisely, we give and develop in symbolic terms algorithms to compute the resolution tree of a plane curve (and the adjunction divisor, in particular), rational parametrizations for ...

متن کامل

Evaluation codes and plane valuations

We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions given by valuations of 2-dimensional function fields. We show that these order functions are simple when their ordered domains are isomorphic to the value semigroup algebra of the corresponding valuation. Otherwise, we provide...

متن کامل

AG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves

We investigate several types of linear codes constructed from two families S̃q and R̃q of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. Plane models for such curves are provided, and the Weierstrass semigroup H(P ) at an Fq-rational point P is shown to be symmetric.

متن کامل

Generalized Bezout's theorem and its applications in coding theory

This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two or more plane curves. A new approach to determine a lower bound on the minimum distance for algebraic-geometric codes defined from a class of plane curves is introduced, based on the generalized Bezout theorem. Examples of more efficient l...

متن کامل

A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound

Since the proof in 1982, by Tsfasman Vlăduţ and Zink of the existence of algebraic-geometric (AG) codes with asymptotic performance exceeding the Gilbert–Varshamov (G–V) bound, one of the challenges in coding theory has been to provide explicit constructions for these codes. In a major step forward during 1995–1996, Garcia and Stichtenoth (G–S) provided an explicit description of algebraic curv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999